Efficient optical network design using multi-granular optical cross-connects with wavelength band switching

ABSTRACT

A method for managing static data traffic of at least one light path in an optical network, comprising the steps of achieving load balanced path routing for the at least one light path, assigning wavelengths to demands of the at least one light path, and, switching the at least one light path according to its assigned wavelength. A method for managing dynamic data traffic of at least one light path in an optical network, comprising the steps of routing the K-shortest path, which has the largest interference length (L), and, assigning waveband with a First-Fit network topology based on band/port number restriction and minimum weight.

CROSS-REFERENCE TO RELATED APPLICATION

[0001] This patent claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Application No. 60/412,611, filed Sep. 20, 2002, which application is incorporated herein by reference.

FIELD OF THE INVENTION

[0002] This invention relates generally to networks and network architectures, more particularly to optical networks, and, even more particularly, to an efficient optical network design using multi-granular optical cross-connects with wavelength band switching (WBS).

BACKGROUND OF THE INVENTION

[0003] Optical networks using dense wavelength-division multiplexing (DWDM) technology is a key solution to keep up with the tremendous growth in data traffic demand. However, as WDM transmission technology matures, the ability to manage traffic (including switched and protected traffic) in a WDM network is becoming increasingly critical and complicated. In particular, the rapid advances in dense WDM technology (with hundreds of wavelengths per fiber) and world-wide fiber deployment have brought about a tremendous increase in the size (i.e., number of ports) of optical cross-connects (OXCs), as well as the cost and difficulty associated with controlling such large OXCs. In fact, despite the remarkable technological advances in building photonic cross-connect systems and associated switch fabrics, the high cost (both capital and operating expenditures) and unproven reliability of huge switches (e.g., with 1000 ports or more) have not justified their deployment.

[0004] Waveband Switching (WBS) in conjunction with multi-granular OXC (MG-OXC) architectures has been proposed to support the ever-increasing traffic while maintaining the cost and complexity of the system at a reasonable level. The main idea of WBS is to group several wavelengths together as a band, and switch the band as a single entity (i.e., using a single port) whenever possible (that is a band is demultiplexed into individual wavelengths if and only if necessary, e.g., when the band carries at least one lightpath which needs to be dropped or added). A complementary hardware is MG-OXC that not only can switch traffic at multiple levels such as fiber, wavelength band (or waveband), and individual wavelength (or even sub-wavelength), but also can add and drop traffic at multiple levels, as well as multiplex and demultiplex traffic from one level to another within an MG-OXC itself. By using WBS in conjunction with MG-OXCs, the total number of ports required in such network (to be called a WBS network hereafter) to support a given amount of traffic can be much lower than that in a traditional wavelength routed network (WRN) that uses ordinary OXCs (that switch traffic only at the wavelength level). The reason is that 60-80% of traffic simply bypasses the nodes, and hence the wavelengths carrying such transit traffic do not need to be individually switched in WBS networks (as opposed to WRNs wherein every such wavelength still has to be switched using a single port).

[0005] In addition to reducing the port count (which is a major factor contributing to the overall cost of switching fabrics), the use of bands reduces the number of entities that have to be managed in the system, and enables hierarchical and independent management of the information relevant to wavebands and wavelengths. This translates into reduced size (footprint), power consumption and simplified network management. Moreover, relatively small-scale modular switching matrices are now sufficient to construct large-capacity optical cross-connects, making the system more scalable. With WBS, some or most of the wavelength paths (or lightpaths) do not have to pass through individual wavelength filters, thus simplifying the multiplexer and demultiplexer design as well. In fact, cascading of FTB and BTW demultiplexers has been shown to be effective in reducing cross-talk, which is critically important in building large capacity backbone networks. Finally, all of these also result in reduced complexity of controlling the switch matrix, provisioning and providing protection/restoration in a similar way.

[0006] This patent describes efficient heuristic algorithms for WBS with MG-OXCs. This work considers the case of both off-line and on-line traffic. Optimal Integer Linear Programming or ILP formulations and efficient heuristic algorithms are provided for the off-line MG-OXC network design and dimensioning. For the on-line traffic, efficient heuristic algorithms are provided to reduce the used number of ports or alternately minimize the blocking to the traffic for a given number of ports. The work also provides methodologies for efficient protection and restoration with wavelength and waveband conversion in MG-OXC networks. This technology can be applied to consider various survivability schemes with SRLG and also to networks with limited or no wavelength conversion capabilities. In addition, the technology can also be applied to hybrid optical networks, i.e., networks consisting of a mix of both ordinary OXC and MG-OXCs. A new cost effective MG-OXC architecture and cost model is also provided.

[0007] Other Solutions

[0008] In this section we review some of the existing work on MG-OXC and WBS. So far, only very limited research has been done on MG-OXC and WBS. The concept of WBS was researched in rings and on MG-OXCs in mesh networks, a couple of IETF drafts on Generalized Multi-protocol Label Switching (G-MPLS) control plan extension to WBS networks, and one journal paper on WBS algorithms.

[0009] The other research discusses how optical bypass can be efficiently realized using wavelength bands in rings (LANs or MANs). The feasibility and cascadability of MG-OXCs in rings were investigated either via computer simulation or prototyping. Limited analytic work for some special traffic patterns in rings is done. However, none of these works addressed WBS in networks with the mesh topology (useful for the WANs). Others have suggested a two-layer switching fabric containing a band cross-connect (BXC) and a wavelength cross-connect (WXC). Others added a new switching layer, i.e., a fiber cross-connect (FXC) (but without wavelength conversion or waveband conversion capabilities), still others have proposed a single layer MG-OXC (which also does not include wavelength conversion or waveband conversion). In addition, a waveband OXC structure with “broadcast and select” function was proposed. None of these papers offered any interesting WBS algorithms.

[0010] Wavelength Grouping for WBS

[0011] There are several wavelength grouping strategies including: (1) end-to-end grouping: grouping the traffic (lightpaths) with same source-destination (s-d) only; (2) one-end-grouping: grouping the traffic between the same source (or destination) nodes and different destination (or source) nodes; (3) sub path grouping: grouping traffic with common sub path (from any source to any destination). Note that all existing work assumes either Strategy 1 or 2. Strategy 3 as it is the most powerful (in terms of being able to maximize the benefits of WBS) although it is also the most complex to use in WBS algorithms. Others studied a two-layer MG-OXC as in assuming wavelength grouping Strategy 2 (with one-end-grouping) only (which makes it difficult to take advantage of the benefits of WBS), and full wavelength conversion.

[0012] MG-OXC Architectures

[0013] Prior research typically considered MG-OXC architectures as shown in FIGS. 1 and 2. Note that these architectures themselves are our novel extension (i.e., with wavelength and waveband conversion banks, T_(x)/R_(x) and DXC components) to existing architectures. The first MG-OXC architecture includes the FXC, BXC and WXC layers. As shown in the Figures, the WXC and BXC layers consist of cross-connect(s) and multiplexer(s)/demultiplexer(s). The WXC layer includes a wavelength cross-connect (WXC) switch that is used to bypass/add/drop lightpaths at this layer, band-to-wavelength (BTW) demultiplexers, and wavelength-to-band (WTB) multiplexers. The BTW demultiplexers are used to demultiplex bands into wavelengths, while the WTB multiplexers are used to multiplex wavelengths into bands. At the BXC layer, the waveband cross-connect (BXC) is used to switch wavebands. The BXC layer also includes the fiber-to-band (FTB) demultiplexers and band-to-fiber (BTF) multiplexers. Similarly, fiber cross-connect (FXC) is used to switch fibers at the FXC layer. This architecture is dynamic in that (1) which fiber(s) and which band(s) in the fiber(s) to go through the FTB and BTW demultiplexers, respectively, can be dynamically reconfigured; and (2) some waveband(s) and some wavelength(s) can go through the waveband conversion and wavelength conversion, respectively. Clearly, this architecture is the most flexible as it allows a completely dynamic reconfiguration of the fibers, bands, and wavelengths for drop, add or bypass.

[0014] Compared to the first MG-OXC, the second one is a single-layer MG-OXC which has only one common switching fabric, as shown in FIG. 2. This switching matrix includes three logical parts corresponding to FXC, BXC and WXC, respectively. However, the major differences are the elimination of FTB/BTW demultiplexers and BTF/WTB multiplexers between different layers, which results in a simpler architecture to implement, configure and control. Another advantage of this single-layer MG-OXC is better signal quality because all lightpaths that do not require wavelength or waveband conversion go through one switching fabric (except those requiring conversion) where as in the multi-layer MG-OXCs, some of them may go through 2 to 3 switching fabrics (i.e., FXC, BXC and WXC). As a tradeoff, some incoming fibers, e.g., fiber n, are pre-configured as “designated fibers”. Only designated fiber(s) can have some of its bands dropped while the remaining bands bypass the node, all other non-designated incoming fibers (e.g., fibers 1 and 2) have to have all the bands either bypass the node entirely or be dropped entirely. Similarly, within these designated fiber(s), only designated band(s) can have some of its wavelengths dropped while the remaining bands bypass the node.

[0015] Each of these architectures are either limited or otherwise extreme solutions. For example, the first one may be an overkill and hence too expensive, complicated and unnecessary, while the second may be too limited in terms of its adaptability (reconfigurability) to efficiently reduce the port count.

[0016] There has been very limited work on efficient optical network design using MG-OXC with WBS. They all represent early stage work that is neither comprehensive nor complete. In fact, many basic problems including which MG-OXC architectures should be used, and how wavelength grouping can be done efficiently in WBS networks are still open. More advanced issues such as survivability using novel waveband recovery schemes and wavelength, waveband conversion in MG-OXC networks, though important have not yet been studied.

[0017] All prior work either assumed only simple metro-area or ring networks. Accordingly, very few simple and inefficient ILP formulations and heuristics for wavelength grouping were developed for WBS. In particular most work considered restricted simple wavelength grouping techniques, such as grouping traffic from the same source(s) to same destination(s)

[0018] or trying to band or group lightpaths with the same destination(s) only. In addition, these works simplify the problem by assuming full wavelength conversion capability at all nodes, which may not be the case in reality.

[0019] Further, all prior work has considered WBS for static off-line traffic only. None of the work has considered WBS and MG-OXC architectures and design for dynamic on-line traffic.

[0020] The new challenges in designing WBS networks require innovative solutions that can only be obtained by building upon and advancing the knowledge of, and techniques for WRNs. More specifically, although a tremendous amount of work on WRNs has been carried out, and wavelength routing is still fundamental to a WBS network, the work on WBS (and MG-OXCs) in terms of the objective and techniques are quite different from all existing work on WRNs. For example, a common objective in designing (dimensioning) a WRN is to reduce the number of wavelengths required or the number of wavelength-hops used (which is a weighted sum taking into account the number of hops a wavelength path spans).

[0021] Due to possible failures of the ports and multiplexers/demultiplexers within a MG-OXC that are dedicated to wavebands, as well as possible failure of waveband converters, one or more wavelength bands in one or more fibers may be affected, but not the entire fiber or link (cable). Existing protection restoration approaches deal only with failures of individual wavelengths and fiber/link failure. Hence, new approaches and techniques to provide effective protection and restoration based on the novel concept of band-segment become interesting, so does the novel use of waveband conversion and/or wavelength conversion to recover from waveband failures.

[0022] Open Issues in WBS with MG-OXC

[0023] To summarize, (1) none of the prior work has considered the issue of survivability and (2) waveband, wavelength conversion in MG-OXC networks. All prior work assumes full wavelength conversion capability at all the nodes in the MG-OXC network. (3) Further, the topic of efficient WBS under on-line dynamic traffic conditions has not been addressed. All existing work assumes that traffic is off-line i.e., given a priori and even so only develop simple grouping algorithms for WBS. (4) So far, existing work on WBS networks has focused on minimizing the port count only. Clearly, the cost of a multi-layer MG-OXC may be more (e.g., include additional FTB demultiplexers for interconnecting FXC and BXC layers). With respect to a network, we should consider not only the cost of all nodes, but also the cost of wavelengths/fibers (including amplifiers). (5) No research has focused on how to design MG-OXCs to cut down the overall cost of the system by not only reducing the number of ports, but also decreasing/simplifying other components such as multiplexers/demultiplexers and transmitters/receivers, as well as increasing bandwidth utilization (or reducing the number of wavelengths needed).

BRIEF SUMMARY OF THE INVENTION

[0024] Wavelength Band Switching (WBS) has been widely recognized as a means to support the ever-increasing traffic while maintaining the cost and complexity of the system at a reasonable level. Both standardization documents and commercial products are incorporating WBS-aware components. However, WBS-related problems of theoretical interests have only recently attracted the attention of the research community, and some of them have not been explored fully. More specifically, the design of a MG-OXC architecture, algorithms for online/offline traffic, algorithms for utilizing wavelength/waveband conversion, and algorithms for protection/restoration in WBS networks are challenging. In this patent, we provide efficient heuristic algorithms for WBS with MG-OXCs. This invention considers the case of both off-line and on-line traffic. Optimal Integer Linear Programming or ILP formulations and efficient heuristic algorithms are provided for the off-line MG-OXC network design and dimensioning. For the on-line traffic efficient heuristic algorithms are provided to reduce the number of ports or alternately minimize the blocking to the traffic for a given number of ports. The work also provides methodologies for efficient protection and restoration with wavelength and waveband conversion in MG-OXC networks. This technology can be applied to consider various survivability schemes with SRLG and also to networks with limited or no wavelength conversion capabilities. In addition, the technology can also be applied to hybrid optical networks, i.e., networks consisting of a mix of both ordinary OXC and MG-OXCs. A new cost effective MG-OXC architecture and cost model is also provided. We now describe the architectures, theories and algorithms as well as practical techniques for efficient Optical Network design using Multi-granular Optical Cross-connects with Wavelength Band Switching.

[0025] The proposed techniques and algorithms significantly outperform existing heuristics in WRN and MG-OXC networks in terms of port count reduction, while requiring only a very small increase in the number of wavelength-hops. In order to verify the near-optimality of the heuristic algorithms, we develop ILP formulations for optimal WBS using minimum number of ports, and compare the results with those of our heuristic algorithms. The proposed algorithms can be applied to both static and dynamic traffic.

[0026] A primary object of the invention is to support ever-increasing traffic while maintaining the cost and complexity of the system at a reasonable level.

[0027] Another object of the invention is to develop and provide efficient heuristic algorithms for port reduction in WBS networks, running much faster than ILP schemes, yet achieving near optimal results.

[0028] A further object of the invention is to provide a huge reduction in port count while also achieving bandwidth efficiency.

[0029] Still another object of the invention is to provide more flexible and scalable MG-OXC architectures.

[0030] Still a further object of the invention is to provide novel survivability schemes for WBS networks with/without wavelength and waveband conversion.

[0031] These and other objects, features and advantages of the invention will become apparent to those having ordinary skill in the art upon reading the detailed description of the invention in view of the drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0032]FIG. 1 illustrates a three-layer multi-granular photonic cross-connect;

[0033]FIG. 2 illustrates a single-layer multi-granular photonic cross-connect;

[0034]FIG. 3 illustrates a new single-layer multi-granular photonic cross-connect;

[0035]FIG. 4 illustrates a waveband at node;

[0036]FIG. 5 illustrates an example illustrating Steps (C) and (D) in Stage 2 of BPHT;

[0037]FIG. 6 illustrates MG-OXC Architecture for dynamic WBS;

[0038]FIG. 7 illustrates band layer;

[0039]FIG. 8 illustrates wavelength and waveband conversion;

[0040]FIG. 9 illustrates recovery schemes using WBS;

[0041]FIG. 10 illustrates backup bandwidth sharing using WBS;

[0042]FIG. 11 illustrates band swapping and merging for intra-link failure restoration;

[0043]FIG. 12 illustrates T(a) for uniform traffic in NSF network;

[0044]FIG. 13 illustrates T(a) for random traffic in the NSF network; and,

[0045]FIG. 14 illustrates blocking probability for incremental traffic.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Acronyms Used

[0046] The following acronyms are used in the detailed description of the invention:

[0047] WBS: Wavelength Band Switching

[0048] WDM: Wavelength-Division Multiplex (or Multiplexed)

[0049] WRN: Wavelength-Routed Network

[0050] OXC: Optical Cross-Connects

[0051] MG-OXC: Multi-granular Optical Cross-Connects

[0052] RWA: Routing and Wavelength Assignment

[0053] WBO-RWA: Waveband Oblivious optimal RWA

[0054] ILP: Integer Linear Programming

[0055] BPHT: Balanced Path Routing with Heavy-Traffic first waveband assignment

[0056] FXC: Fiber Cross-Connect

[0057] BXC: Band Cross-Connect

[0058] WXC: Wavelength Cross-Connect

[0059] FTB: Fiber-to-Band demultiplexer

[0060] BTW: Band-to-Wavelength demultiplexer

[0061] BTF: Band-to-Fiber multiplexer

[0062] WTB: Wavelength-to-Band multiplexer

[0063] WH: Wavelength Hop

[0064] AP: Active Path

[0065] BP: Backup Path

[0066] BS: Band Segment

[0067] ABS: Active Band Segment

[0068] BBS: Backup Waveband Segment

[0069] H: Number of hops in a lightpath

[0070] L: Interference length (in number of hops) with other existing lightpaths

[0071] MIWRA: Maximum Interference Waveband Routing and Assignment

[0072] Technical field Data and Telecommunication Networks (subfield: Traffic Grooming)

[0073] MG-OXC Architectures:

[0074] Prior research, typically considered MG-OXC architectures as shown in FIGS. 1 and 2. As already pointed out, these architectures themselves are our novel extensions (i.e., with wavelength and waveband conversion banks, Tx/Rx and DXC components) to existing architectures. Further, these architectures are either too complicated (FIG. 1) or too simple and restrictive (FIG. 2).

[0075] The third new MG-OXC we propose achieves a balance between the first two MG-OXCs. More specifically, like the second one, it is also a single-layer architecture so there is neither FTB/BTW demultiplexers nor BTF/WTB multiplexers for connecting different layers. It also has some “designated” fibers (and “designated” bands within these fibers), so it is not as (or too) flexible as the first (multi-layer) MG-OXC. On the other hand, what makes it different (and more powerful) than the first MG-OXC is that this MG-OXC does use a few FTB/BTW demultiplexers and BTF/WTB multiplexers so that even an “non-designated” fiber (band) can drop specific bands (wavelengths, respectively) without subjecting the other bands in the same fiber (wavelengths in the same band, respectively) to O/E/O conversions (through the Transmitter/Receiver block).

[0076] Efficient Network and MG-OXC design for Static Traffic

[0077] We now describe our integer linear formulation and heuristic algorithm for efficient MG-OXC network design for static traffic.

[0078] ILP Model for static WBS

[0079] This section formulated the WBS scheme using integer linear programming. The integer linear programming (ILP) formulation is for multi-fiber networks where the number of fibers per link is f>1. For single-fiber networks, f is always 1 and in fact can be omitted from the formulations.

[0080] To facilitate presentation and understanding of our ILP model, we define variables to describe the properties of a node (instead of a link as in other ILP formulations for RWA). More specifically, to obtain and represent the detailed information of the routing and wavelength assignment, we introduce the following binary variables to be used in the ILP formulation.

[0081] Note that the traffic at a node can be drop traffic, bypass traffic or add traffic. The following four variables: V_(i,o,p) ^(n,w)W_(i,o) ^(n,w)B_(i,o) ^(n,b) and F_(i,o) ^(n) are used for describing the lightpaths, each of which can represent bypass traffic when i ε I_(n), o ε O_(n); add traffic when iε, A_(n), o ε O_(n) or drop traffic when i ε I_(n), o ε D_(n). An incoming (or outgoing) fiber refers to either an input (or output) fiber from (or to) a neighboring node or a fiber connecting the local node to any add (or drop) port at the WXC, BXC and FXC layer).

[0082] As a consequence of multiplexing/demultiplexing, we need to use multiplexer/demultiplexer port(s) at the respective layers. FIG. 4 shows one such example involving two lightpaths, one for node pair p₁ using λ₁ on input fiber 1 and the other for node pair p₂ using λ₂ to be added locally. Using the MG-OXC, the two lightpaths are grouped together in the same band of the same output fiber (e.g., fiber 2). By definition, we have V_(i1,o2,p1) ^(n,λ1)=V_(a0,o2,p2) ^(n,λ2)=1. For this, input fiber 1 (containing the lightpath for p₁) has to be demultiplexed into band b₁ (and other bands) using a FTB demultiplexer (hence, FTB_(i1) ^(n)=1). Band b₁ then has to be further demultiplexed into λ₁ and other wavelengths (hence, BTW_(i1) ^(n,b1)=1) to switch the lightpath for p₁ (hence, W_(i1,o2) ^(n,λ1)=1). The second lightpath for p₂ is added into band b₁ using a WTB multiplexer (hence, WTB_(o2) ^(n,b1)=1). Now that the two lightpaths are in the same band, the band is multiplexed onto a fiber using a BTF multiplexer (hence, BTF_(o2) ^(n)=1), and then transmitted onto output fiber 2.

[0083] Objection Function

[0084] Let WXC_(n), BXC_(n) and FXC_(n) be the number of ports at WXC, BXC and FXC layers at node n, respectively. There are two reasonable objectives. The first is to minimize the total cost associated with the MG-OXC ports in the network, that is, $\begin{matrix} {{minimize}\left( {{a \times {\sum\limits_{n}^{\quad}\quad {WXCn}}} + {\beta \times {\sum\limits_{n}^{\quad}\quad {BXCn}}} + {\gamma \times {\sum\limits_{n}^{\quad}\quad {FXCn}}}} \right)} & (1) \end{matrix}$

[0085] where α, β and γ are the coefficients or weights corresponding to the cost of each port at the WXC, BXC and FXC layer, respectively. When α=β=γ=1, the objective becomes to minimize the total number of MG-OXC ports in the network, which is the sum of the port count at FXC, BXC and WXC layers respectively.

[0086] The second objective is to minimize the maximum cost at each node over all nodes. This can be formulated as: ${minimize}\quad {\max\limits_{n}\left( {{\alpha \times {WXC}_{n}} + {\beta \times {BXC}_{n}} + {\gamma \times {FXC}_{n}}} \right)}$

[0087] (2)

[0088] When α=β=γ=1, this becomes equal to minimizing the maximum port count (node size) over all the nodes in the network.

[0089] Constraints

[0090] For Routing and Wavelength Assignment, the following constraints on traffic flows, wavelength-capacity and wavelength-continuity are similar to those in the traditional RWA ILP formulations. $\begin{matrix} \left\{ \begin{matrix} {{{\sum\limits_{{i \in {An}},{o \in O_{n}}}V_{i,o,p}^{n,w}} = {{\sum\limits_{{i \in {In}},{o \in D_{n}}}\overset{\quad}{v_{i,o,p}^{n,w}}} = {{0\quad n} \neq {p.{src}}}}},{p.{dest}},{\forall w}} & (i) & \quad \\ {{{\sum\limits_{w,{i \in {An}},{o \in O_{n}}}V_{i,o,p}^{n,w}} = \quad {{{tp}\quad n} = {p.{src}}}},} & ({ii}) & \forall_{p;} \\ {{{\sum\limits_{w,{i \in {In}},{o \in D_{n}}}V_{i,o,p}^{n,w}} = \quad {{{tp}\quad n} = {p.{dest}}}},} & ({iii}) & \quad \end{matrix} \right. & (3) \\ \begin{matrix} {{{\sum\limits_{p,{o \in {ODn}}}V_{i,o,p}^{n,w}} \leq {1\quad \forall_{w}}},{{i \in I_{n}};}} \\ {{{\sum\limits_{p,{i \in {IAn}}}V_{i,o,p}^{n,w}} \leq {1\quad \forall_{w}}},{{o \in O_{n}};}} \end{matrix} & (4) \\ {{{{\sum\limits_{{i \in {IAm}},{o \in O_{m,n}^{f}}}V_{i,o,p}^{m,w}} - {\sum\limits_{i \in I_{n,m,{o \in {OD}_{n}}}^{f}}v_{i,o,p}^{n,w}}} = {0\quad \forall_{m}}},n,p,w,{f;}} & (6) \end{matrix}$

[0091] Equation (3) is the traffic flow constraint; Equations (4) and (5) are the wavelength capacity constraint; Equation (6) is the wavelength continuity constraint.

[0092] For Waveband Switching, we need the following additional constraints. $\begin{matrix} {1 \geq {F_{i,o}^{n} + B_{i,o}^{n,b} + W_{i,o}^{n,w}} \geq {\sum\limits_{p}{\overset{\quad}{V_{i,o,p}^{n,w}}{\forall_{w}{\in {\pounds_{b,}i} \in {{IA}_{n,}o} \in {OD}_{n;}}}}}} & (7) \end{matrix}$

[0093] This constrains ensures that if a lightpath uses wavelength w belonging to band b of incoming fiber i and outgoing fiber o $\left( {{i.e.},{{\sum\limits_{p}\overset{\quad}{V_{i,o,p}^{n,w}}} = 1}} \right),$

[0094] then at node n,

[0095] exactly one of FXC, BXC and WXC cross-connect port will be used for switching this lightpath when it is a bypass (i.e., i ε I_(n), o ε O_(n)) or

[0096] exactly one of F_(add), B_(add) and W_(add) port will be used for adding this lightpath when in is added (i.e., i ε A_(n), o ε O_(n)) or

[0097] exactly one of F_(drop), B_(drop) and W_(drop) port will be used for dropping this lightpath when it is dropped (i.e., i ε I_(n), o ε D_(n)).

BTF_(o) ^(n)≧WTB_(o) ^(n,b)≧W_(i,o) ^(n,w)∀_(w)ε£_(b,o) ε O_(n); i ε IA_(n);  (8)

[0098] The above constraint ensures that a wavelength w at node n switched or added at the WXC layer has to pass a WTB multiplexer to the BXC layer. At the same time, every band from a WTB multiplexer has to pass a BTF multiplexer before it can leave node n. Similarly, Equation (9) below specifies that a wavelength w switched or dropped at the WXC layer has to come from BXC layer using a BTW demultiplexer, and in addition every band demultiplexed by BTW can only come from a FTB demultiplexer.

FTB_(i) ^(n)≧BTW_(i) ^(n,b)≧W_(i,o) ^(n,w)∀_(w)ε£_(b), o ε OD_(n); i ε I_(n);  (9)

[0099] Finally, any bypass or add bands should pass a BTF multiplexer as specified in equation (10) and similarly, any drop or bypass band can only come from a FTB demultiplexer as specified in Equation (11).

BTF_(o) ^(n)≧B_(i,o) ^(n,b)∀_(o) ε O_(n); i ε IA_(n);  (10)

FTB_(i) ^(n)≧B_(i,o) ^(n,b)∀_(o) ε OD_(n); i ε I_(n);  (11)

[0100] For Port Numbers, the following constraints specify the minimum number of ports required at each layer of the MG-OXC. $\begin{matrix} {{{WXC}_{n} = {\sum\limits_{{i \in {IAn}},{o \in {ODn}},w}{V_{i,o}^{m,w}\forall_{n}}}};} & (12) \\ {{{BXC}_{n} = {{\sum\limits_{{i \in {IAn}},{o \in {ODn}},b}B_{i,o}^{n,b}} + {\sum\limits_{{o \in {On}},b}{WTB}_{o}^{n,b}} + {\underset{{i \in {In}},b}{\overset{\quad}{\sum{BTW}_{i}^{n,b}}}\forall_{n}}}};} & (13) \\ {{{FXC}_{n} = {{\sum\limits_{{i \in {IAn}},{o \in {ODn}}}F_{i,o}^{n}} + {\underset{o \in {On}}{\sum\quad}{{BTF}_{o}^{n}{\sum\limits_{i \in {In}}^{\quad}\quad {{FTB}_{i}^{n}\forall_{n}}}}}}};} & (14) \end{matrix}$

[0101] For the WXC layer, the number of input-side ports include the ports for lightpaths coming in from other nodes and locally added lightpaths as specified in (12). The number of input-side ports needed at the BXC layer is the sum of the number of wavebands B_(i,o) ^(n,b) (BXC cross-connect and add/drop/bypass bands) and the number of wavebands from the WTB/BTW multiplexers/demultiplexers as in (13). Similarly, Equation (14) can be used to determine the number of ports at the FXC layer.

[0102] In short, our ILP model (and heuristics to be described next) considers the design of MG-OXC nodes (i.e., the number of ports allocated at each of the layers) with the objective to minimize either the total port count or the maximum port count over all MG-OXC nodes in the network given a set of traffic demands to be satisfied on a given network topology, wherein each link in the network may have single or multiple fibers.

[0103] Note that if we eliminate the FXC and BXC layers (i.e., set corresponding variables to 0) from the MG-OXC, the above ILP formulation with Objective (1) will minimize the total number of ports, which is equivalent to minimizing WHs using ILP for optimal RWA. As such ILP formulations developed can only be solved for small systems with a few nodes and a few wavelengths on each fiber, we need to develop efficient heuristic-based solutions for large systems.

[0104] Balanced Path Routing With Heavy-Traffic First Waveband Assignment (BPHT), Heuristic Algorithm for Efficient WBS

[0105] Intuitively, to maintain wavelength-continuity in wavelength routed optical networks without wavelength conversion, it is better to assign wavelengths to longer paths (in terms of hops) first. Further, to reduce the number of ports in MG-OXC, it is better to assign paths that have maximum number of links in common, wavelengths in the same fiber (and band), thus increasing the probability of switching the whole fiber (and band) by just using a single FXC (and BXC) port. The following is our three-stage heuristic algorithm called Balanced Path routing with Heavy-Traffic (BPHT) first waveband assignment, which tries to maximize the reduction in the MG-OXC size using the above ideas.

[0106] Stage 1: Balanced Path Routing

[0107] In this stage, we use the following steps to achieve load balanced routing.

[0108] Find K-shortest routes for every node pair (s,d) with non-zero traffic demand as in [40], and order them from the shortest to the longest (in terms of hop number) as P_(s,d) ¹, P_(s,d) ², . . . , P_(s,d) ^(k). Let the number of hops of the shortest route be H_(s,d) (i.e., number of hops in path P_(s,d,) ¹).

[0109] Define the load on every link 1 to be the number of routes already using link 1 (initially, this is 0). Let C be the maximum link load over all the links.

[0110] Use C to achieve load balanced routing, starting with the node pair (s,d) with the largest H_(s,d) value over all node pairs, to determine the route for each node pair. More specifically, for the K-shortest routes P_(s,d) ^(i) of the selected node pair (s,d) where i=1,2, . . . , k, we compute the C and pick one of the routes that minimizes C. If more than one routes, say P_(s,d) ^(i) and P_(s,d) ^(j), have the same minimum C, the shortest one (i.e., P_(s,d) ^(i), if i<j) will be used as the route for (s,d). That is, all the lightpaths from s to d will take this route. After the route for (s,d) is chosen, the process continues to choose one route for each of the remaining node pairs, starting with the one having the largest number of hops along the shortest path, until every node pair with non-zero traffic demand is assigned a route.

[0111] Stage 2: Wavelength Assignment

[0112] Based on the observation that bypass traffic, which goes through two or more hops accounts for 60% -80% of the total traffic in the backbone, we assign the wavelengths to those bypass lightpaths first. At the same time, we also want to give preference to the lightpaths that overlap with many other (shorter) lightpaths in order to maximize the advantage of wavebanding.

[0113] The following steps are used to assign wavelengths to all the lightpath demands once the routing is done in Stage 1. To maximize the benefit of WBS in multi-fiber networks, we introduce a new waveband assignment algorithm, called waveband assignment for multi-fiber WBS (WA-MF-WBS, see Step (D) below).

[0114] (A) For every node pair (s,d), whose route is determined as s=s_(o)→s₁→s₂ . . . s_(n−1)→s_(n)=d in Stage 1, define a set Q_(d) ^(s), which includes all node pairs (s_(i), s_(j)), whose route is s_(i), s_(i+1), . . . , s_(j), as determined in Stage 1, where 0≦i≦n−2, and i+2≦j≦n. Note that it is possible that the route chosen for (s_(i), s_(j)) in Stage 1 is not a sub-path of the route chosen for (s,d), in which case, (s_(i), s_(j)) will not belong to Q_(d) ^(s).

[0115] (B) Calculate the weight for each set Q_(d) ^(s) as ${W_{sd} = {\sum\limits_{p \in Q_{d}^{s}}^{\quad}\quad {h_{p} \times t_{p}}}},$

[0116] where p=(s_(i), s_(j)) εQ_(d) ^(s), h_(p) is the number of hops and t_(p) is the required number of lightpaths from s_(i), s_(j);

[0117] (C) Find the set Q_(d) ^(s) with the largest W_(sd)*.

[0118] (D) Call set Q_(d) ^(s) as L, and assign wavelengths to L as follows.

[0119] i. Suppose that the longest path in L is as follows: s_(o)→s₁→s₂ . . . s_(n−1)→s_(n). Let s=s_(o) and d=s_(n) (which is the case initially based on the definition of Q_(d) ^(s)). Assign wavelengths to the requested lightpaths for the node pair (s,d) by trying to group them into the same fiber, and within each fiber, into the same band(s). More specifically, for each fiber, let 0≦w≦K−1 and 0≦b≦B−1 be the index of wavelength and band respectively, starting from which, an available wavelength and band will be searched in order to fulfill new lightpath requests; In addition, let 0≦f≦F−1 be the index of the fiber currently under consideration (i.e., whose wavelengths may be used for new lightpaths). Initially, f=0 and w=b=0 for all fibers. The following algorithm WA-MF-WBS assigns wavelengths to the lightpaths for a specified node pair p for multi-fiber^(†)wavelength band switching.

[0120] ii. Use WA-MF-WBS to assign wavelengths to the requested lightpaths for (s,s_(j)) starting with the largest j (i.e., j=n−1, n−2, . . . ,2).

[0121] iii. Use WA-MF-WBS to assign wavelengths to the requested lightpaths for (s_(i),d) starting with the smallest i (i.e., i=1, 2 . . . , n−2).

[0122] iv. If there are still node pairs (s_(i), s_(j)) ε Q_(d) ^(s) that have not been considered, repeat from Step (D) by treating S_(i), with the smallest i as s, and s_(j) with the largest j as d. Otherwise go to Step (E).

[0123] (E) Recompute the weight for those node pairs whose routes use any part of the route used by node pair (s,d). For each fiber, re-adjust b and w to be the “next” waveband and the first wavelength in the next waveband, respectively, so as to prevent the lightpaths of the next node pair set (e.g., Q_(d′) ^(s′)) from using the same bands as the lightpaths of Q_(d) ^(s) (thus reducing the need to demultiplex and multiplex the lightpaths belonging to these two sets when they merge and diverge). More specifically, set b=(b+1) mod B, and w=b×W, and then go to step (C). Repeat until all the bypass (multi-hop) lightpath demands are satisfied. Algorithm: WA-MF-WBS while t_(p) > W do $\begin{matrix} {{Find}\quad a\quad {fiber}\quad {starting}\quad {from}\quad {index}\quad f\quad {that}\quad {has}\quad {as}\quad {many}\quad {free}\quad {bands}\quad {as}} \\ {{possible}\quad \left( {{{say}\quad a} \leq \left\lfloor \frac{tp}{W} \right\rfloor} \right)\{} \end{matrix}\quad\quad$

Call the found fiber g, where g may or may not be the same as f; Assign the bands in fiber g to the a. W lightpaths for p; t_(p) = t_(p) − a · W; Set f=g, and update w and b for fiber g accordingly; } end while while t_(p) > 0 do Find a fiber (g), starting from index f, that has at least one free wavelength; Assign a free wavelength (x), starting from index w, to a lightpath for p, where x is most likely to be w; t_(p) = t_(p) − 1; Set f = g, and w = x + 1. Also, update b for fiber g accordingly; end while

[0124] For example, suppose that we are considering node pair set Q₄ ^(o) in FIG. 5, where t_(p)=1 for any pεQ₄ ^(o). Assuming that the lightpaths numbered from 2 to 6 will be routed along the same route as the lightpath 1 (i.e., s_(o)→s₁→s₂ . . . s₃→s₄) as dictated by the load balanced routing algorithm. Then, the weight of the node pair set is 16 as shown, and in addition, the order in which these lightpaths will be assigned wavelengths according to Steps (C) and (D) is from 1 to 6.

[0125] (F) Finally, assign wavelengths to lightpaths between two nodes separated by only one hop, starting with the node pair having the largest lightpath demand.

[0126] Stage 3: Waveband Switching

[0127] Once the wavelength assignment is done, WBS can be performed in a fairly straight-forward way. Basically, we switch as many fibers using FXCs as possible; and then as many wavebands using BXCs as possible. The remaining lightpaths are then individually switched at the WXC layer. The total number of ports used at a given node can then be determined.

[0128] Ideally, BPHT will group traffic from the same source to the same destination, and most of the traffic that has common intermediate links. One of the variations of BPHT (in Stage 1) is to balance the amount of traffic (in terms of the actual number of lightpaths instead of just one route for each node pair) on every link. Another variation is to assign wavelengths to lightpaths with the largest hop count or those for node pairs with the largest weighted traffic demand (i.e., h_(p)×t_(p)) first (assuming e.g., shortest-path routing) in Stage 2. We call the heuristic that varies from BPHT at both Stages 1 and 2 in such a manner, Balanced Traffic routing with Maximum-Hop first waveband assignment (BTMH). In our experiments, we have compared many heuristics and found that the overall performance of BPHT is the best.

[0129] Dynamic Traffic

[0130] In this section, we describe our ILP and heuristic algorithm based solutions for efficient WBS for dynamic traffic.

[0131] We assume that traffic can only be added/dropped from the WXC layer as shown in FIG. 6. Hence, while counting the ports, we will ignore the ports for add/drop traffic at the FXC and BXC layers.

[0132] From the figure we note that:

[0133] FXC layer has 2*δ*F ports, which is the upper bound [41].

[0134] At BXC layer, we assume only μ*δ*F*B bands can go through BTW to WXC layer and band drop ports (0<μ≦1), so only (1+μ)*F*B ports are needed in this layer.

[0135] WXC layer has μ*δ*F*B*W ports.

[0136] Hence, the total number of ports can be calculated as follows:

MG-OXC_(n)=2*δ*F+(1+μ)*δ*F*B+μ*δ*F*B*W  (15)

[0137] Similarly, we can get the total number of ports of a node in an ordinary-OXC network as OXC_(n)=δ*F*B*W

[0138] Since the MG-OXC reduces the cost (i.e., number of ports) of OXC nodes, we can expect that: MG-OXC_(n)<OXC_(n), i.e., number of ports at a MG-OXC node n is less that that at an ordinary-OXC node. Hence we have:

2*δF+(1+μ)*δ*F*B+μ*δ*F*B*W<δ*F*B*W  (16) $\begin{matrix} {{\mu < \frac{{B*W} - {BN} - 2}{B + {B*W}}} = \frac{K - B - 2}{K + B}} & (17) \end{matrix}$

[0139] This equation shows us how to approximately decide the value of μ. It also indicates that if B increases, μ should decrease (note that the lower the value of μ the better), which means that if the wavelengths in a fiber are grouped into many bands (i.e., by increasing the number of bands in a fiber), then the chances for a lightpath to go through WXC layer will be smaller, hence μ should also be smaller. We can also get the total number ratio T(a) (i.e., port count of MG-OXC/port count of OXC) as follows. $\begin{matrix} {{T(a)} = {\frac{{2*\delta \quad F} + {\left( {1 + \mu} \right)*\delta*F*B} + {\mu*\delta*F*B*W}}{\delta*F*B*W} \approx {\mu + \frac{1 + \mu}{W}}}} & (18) \end{matrix}$

[0140] Online ILP Model for Dynamic WBS

[0141] Based on current network status, we try to satisfy the traffic demand with minimum active ports or wavelength.

[0142] Similar to our previous Static Traffic case, we can get ILP model for dynamic Incremental traffic. The difference is that now we have a limited number of BTW/WTB demultiplexers/multiplexers, and no add/drop fibers, bands at a node.

[0143] Objective: minimize the activate ports.

[0144] Constraints: All constraints from the static version can be used here. Additional constraints on the limited number of BTW/WTB demultiplexers/multiplexers are needed as follows: $\begin{matrix} {{\mu*\delta*F*B} \geq {\sum\limits_{o \in O_{n}}{{WTB}_{o}^{n,b}\forall_{b}}}} & (19) \\ {{\mu*\delta*F} \geq {\sum\limits_{i \in I_{n}}^{\quad}{{BTW}_{i}^{n,b}\forall_{b}}}} & (20) \end{matrix}$

[0145] Another version of the ILP formulation in which a BTW/WTB demultiplexer/multiplexer can be configured to demultiplex/multiplex any bands is as follows: $\begin{matrix} {{\mu*\delta*F*B} \geq {\sum\limits_{{i \in O_{n}},b}^{\quad}\quad {{WTB}_{o}^{n,b}\forall_{b}}}} & (21) \\ {{\mu*\delta*F*B} \geq {\sum\limits_{{i \in I_{n}},b}^{\quad}\quad {BTW}_{i}^{n,b}}} & (22) \end{matrix}$

[0146] Our heuristic algorithms use the ideas in this second formulation.

[0147] Maximum Interference Waveband Routing and Assignment (MIWRA)

[0148] As shown by others, the interference length (L) is an important parameter for optical network. The interference length of a lightpath is defined as the number of hops (along their respective routes) that it has in common with other existing lightpaths. It is also shown that the gain of having wavelength conversion will decrease with large L. Our heuristic MIWRA, tries to route demands such that L is maximized, i.e., the overlap with other existing demand routes is maximized. This in turn leads to maximum packing of traffic demands into bands further leading to reduced port count.

[0149] Based on the above ideas and on layered band-graph approach, we do waveband routing and assignment as follows:

[0150] Routing: Try K-shortest path, and choose the path, which has largest interference length (L).

[0151] Waveband Assignment: First-Fit based on band/port number restriction and minimum weight (as described below)

[0152] Here is an example: The network topology is just as anyone of the layers (every band has one layer), wherein each fiber has two bands b₀ and b₁, and each band has two wavelengths. Currently, there are already two light paths: λ₀(S₂→S₃) and λ₂(S₄→S₅→S₆→S₇) and a new lightpath demand from S₀ to S₇. From the topology, we can have two paths to route the demand: k₀(S₀→S₁→S₂→S₃→S₇) and k₁ (S₀→S₄→S₅→S₆→S₇).

[0153] To satisfy this new lightpath demand, we will try following steps:

[0154] 1. Within every layer, calculate the weight for every (k,b) pair, W_(k) ^(b), where 0≦k<K is the index of shortest path, 0≦b<B is index of band. We have the following three methods to set the weight.

[0155] W_(k) ^(b)=h, where h is the hop number, or $W_{k}^{b} = \frac{1}{L,}$

[0156] where L is interference length L (number of shared links), or $W_{k}^{b} = {\frac{h}{L}.}$

[0157] 2. Find the minimum W_(k) ^(b), which can satisfy the demand. Then assign the corresponding wavelength to the new demand in layer b and using the kth shortest path.

[0158] 3. If no layer can satisfy this demand, then block it.

[0159] In this example, if we are trying to maximize the Interference length L, then we have, W_(k0) ^(b0)=1, W_(k0) ^(b0)=⅓. We will try to route the lightpath along k₁ and use λ₃ in b₁ to satisfy the new demand in layer b₁ as shown by the broken line in the figure.

[0160] Similarly, if we have wavelength conversion, to reduce the port count using minimal wavelength conversion, we should try to satisfy the demand within one (i.e., the same) band as much as possible, hence using less wavelength conversion.

[0161] Waveband Versus Wavelength Conversion

[0162] In WRNs, wavelength conversion capabilities can be incorporated at either all or some of the OXCs (the latter is referred to as sparse wavelength conversion). With wavelength conversion, a lightpath no longer has to occupy the same wavelength on all the links that it spans (this is called the wavelength-continuity constraint). Wavelength conversion can also be full or limited (or partial) in the latter case, a wavelength can be converted only to a subset of the wavelengths. Prior research on wavelength conversion in WRNs has in general confirmed the benefit of wavelength conversion in reducing blocking probability, and to a lesser extent, in reducing the wavelength requirement to carry a given set of traffic demands (this of course is dependent on the traffic and topology). In addition, major benefit can most likely be obtained by using sparse wavelength conversion and/or limited wavelength conversion.

[0163] Although there has been a significant amount of research on the benefit of wavelength conversion in WRNs, none of the existing works have considered the benefit of wavelength conversion in WBS networks with MG-OXCs. In fact, all existing research on WBS networks either assumes full or no wavelength conversion at all the nodes. Note that, it is obvious that wavelength conversion can ease wavelength requirement and facilitate waveband assignment, and thus may also reduce the port count (and multiplexers/demultiplexers) required in MG-OXCs. To perform wavelength conversion, it is required that the fiber carrying the wavelength(s) to be converted be demultiplexed into bands, and then into wavelengths, thus consuming resources (e.g., ports and multiplexers/demultiplexers) in the MG-OXCs. In our invention, we examine the tradeoffs involved in using wavelength conversion in WBS networks.

[0164] The following example show that while in WRNs with full wavelength conversion, wavelength assignment is trivial, in WBS networks, one must assign wavelengths judiciously in order to reduce the port count of MG-OXCs. In this example shown in FIG. 8, assume that there is one fiber on each link with two bands, each having two wavelengths (i.e., {λ₀,λ₁} ε b₀, {λ₂,λ₃} ε b₁. However, wavelength λ₂ is not available on any of the links shown. In addition, there are three existing lightpaths, one from node 1 to node 5 using λ₀, the second from node 2 to node 4 using λ₃ and the third from node 6 to node 4 using λ₃. Hence, the only wavelengths available on the link from node 4 to node 5 are λ₁ and λ₃.

[0165] Now assume that a new lightpath using e.g., λ₁ on the link from node 6 to 4 is assigned λ₁ on the link from node 4 to node 5 as shown in FIG. 8(a). As a result, another new lightpath from node 1 to node 5 must then use λ₁ on links from node 1 to node 4, and then be converted to λ₃ on the link from node 4 to node 5.

[0166] Alternately, as shown in FIG. 8(b), one can assign λ₃ to the first new lightpath on the link from node 4 to node 5, and assign λ₁ to the second new lightpath all the way from node 1 to node 5. In a WRN, this alternative does not result in much difference at all as it also requires a wavelength conversion at node 4. However, in a WBS network using MG-OXCs, this alternative will require fewer ports. The reason is that in FIG. 8(b) band b₀ no longer needs to be demultiplexed at node 4. Note that, performing a wavelength conversion to the first new lightpath does not increase the port count because even in FIG. 8(a), band b₀ on the fiber from node 6 to node 4 carrying the first new lightpath needs to be demultiplexed into wavelengths so that its λ₁ can be multiplexed with λ₀ on the link from node 4 to node 5.

[0167] In addition, none of the prior research has studied the benefit of waveband conversion (without full wavelength conversion) in WBS networks. Having waveband conversion is similar to, but not identical to having limited wavelength conversion. For example, if we assume there are 2 wavelengths in each band (i.e., {λ₀,λ₁}ε b₀, {λ₂,λ₃}ε b₁, {λ₄,λ₅}ε b₂, . . . ). Then with waveband conversion, converting band b₀ to bands b₁ or b₂ is similar to having limited conversion, i.e., λ₀ can only be converted to λ₂ or λ₄, while λ₁ can only be converted to λ₃ and λ₅. On the other hand, the difference is that, with waveband conversion, we are now forced to convert λ₀ to λ₂ and also λ₁ to λ₃ at the same time. Moreover, waveband conversion can be accomplished using novel technologies without having to demultiplex each band into individual wavelengths, which could be a major benefit in terms of reducing the port count of MG-OXCs.

[0168] For the above reasons, we provide the benefits as well as limits of utilizing waveband conversion in WBS networks, and compare them with the benefits of (as well as tradeoffs involved in) using wavelength conversion. More specifically, we provide various MG-OXCs with waveband (and/or wavelength conversion) capabilities, and WBS algorithms that can take advantage of such capabilities in terms of costs (e.g., number of ports and number of wavelengths), performance (throughout and blocking probability) and complexity (algorithmic and control), in the same context as what has been described in the previous two subsections.

[0169] Waveband Failure Recovery in MG-OXC Networks

[0170] Due to the high bit rate of a single wavelength (up to 40 Gbps), network survivability becomes an important design problem in optical networks. Protection and restoration schemes for failure recovery from a broken fiber link or an OXC node (or in general a failed Shared Risk Link Group or SRLG) have been studied extensively. However, previous research has only examined recovery from such a failure at either the fiber or wavelength level in WRNs, and studied the tradeoffs involved in recovery at these two different levels.

[0171] With the introduction of multi-granular WBS networks, a waveband may fail because of a malfunctioning port at, the BXC layer, a broken waveband multiplexing/demultiplexers or waveband converter. If the other bands in the same fiber are not affected by the failure, simply recovering the traffic carried by the affected band can be more bandwidth efficient (or more likely) to succeed in restoring the traffic) than recovering the traffic carried by the entire fiber (as if the fiber is cut) although the latter is more simple and has a faster response/restoration time. Even when a fiber is cut, treating the traffic carried by one band as a basic unit for recovery can achieve a useful balance between treating the entire fiber or each individual wavelength as a basic recovery unit. We study not only the tradeoffs involved in recovery from a fiber link failure at the band level (as opposed to the fiber or wavelength level), but also provide new ways to recover from waveband or wavelength failures in WBS networks as to be described next.

[0172] Novel Band-Segment Based Failure Recovery

[0173] While recovering at the fiber level is done via link protection/restoration, recovering at the wavelength level is often done via path protection (where an entire lightpath is routed from the source). To recover at the band level, it may be useful to first define band-segment or BS of a given band b_(i) to be the portion of fiber route between two MG-OXCs such that b_(i) is formed (e.g., multiplexed from wavelengths using a WTB) at the first MG-OXC and then demultiplexed into wavelengths at the second MG-OXC (e.g., using a BTW). That is, within an BS, the lightpaths carried in the band are not switched individually. Two examples of active (also called primary or working) band-segments are shown in FIG. 9. The first, denoted by ABS0, goes from node 1 to node 3 via node 2, carrying two active lightpaths AP0 and AP1 (the former is dropped at node 3). The second by ABS1, goes from node 3 to node 4 carrying two active lightpaths AP1 and AP2 (the latter is added at node 3).

[0174] Based on the concept of band-segment (BS), failure recovery can be accomplished in two ways as shown in FIGS. 9(a) and (b), respectively. The first approach is to recover the affected ABS0 as a basic unit using one backup (or alternate) BS, denoted by BBS0 (which includes backup lightpath BP0 and lightpath segment BP1) as shown in FIG. 9(a). The second approach is to recover each individual lightpath/lightpath segment carried in the affected band-segment as a unit. Note that, this is similar but not identical to recovering at the wavelength level without regard to the concept of BS.

[0175] More specifically, if only the lightpaths with same source and destination are grouped into a band, it is convenient to protect all the lightpaths in a waveband segment. Otherwise, a lightpath may transit one or more band-segment along its route as API does in FIG. 9, which reduces the port count but complicates things like fault localization. Such issues in failure recovery are unique to WBS networks, and have not been researched.

[0176] New Backup Bandwidth Sharing Techniques

[0177] We also investigate how backup bandwidth sharing can be achieved in band-segment based protection scheme. As shown in FIG. 10(a), when the two active band-segments ABS0 and ABS1 (in two different fibers) are node-disjoint, their respective backups BBS0 and BBS1 can share bandwidth, and still recover any single failure (of a fiber link or a node other than node 1 or 5) in the network.

[0178] While the above is similar to shared mesh (path) protection in WRNs, the following example shows unique backup bandwidth sharing opportunities in band-segment based protection in WBS networks. As shown in FIG. 10(b), even though ABS0 and ABS1, which can be in the same fiber or two different fibers, are not link disjoint, their corresponding BBS0 and BBS1 can still share the bandwidth on links 5→6→7 as long as only one band, either ABS0 or ABS1, can fail if the two bands are in the same fiber (or if they are in two fibers, as long as only one fiber can fail). In fact, using the novel technique called band-merging to be described next, BBS0 and BBS1 may use the same backup band-segment on links 5→6→7 even if both ABS0 and ABS1 are affected by the broken link 2→3.

[0179] Unique Band Swapping and Merging Techniques

[0180] We provide the novel use of waveband conversion (and wavelength conversion) in failure recovery. For example, assume that a fiber has two bands b₀ and b₁, each with 3 wavelengths as shown in FIG. 11(a). Further assume that all wavelengths except λ₄, are used. Now assume that λ₁ in b₀ alone is affected by a wavelength failure. To recover from such a failure using the spare bandwidth on λ₄, one may convert λ₁ to λ₄ at a node prior to the fault, but this requires both bands to be demultiplexed at this node. To avoid demultiplexing of the bands and preserve the wavelength grouping, a new technique called band-swapping which converts band b₀ to b₁ and b₁ to b₀ can be used to recover from the failure.

[0181] As another example, assume that λ₀ and λ₁ are used in b₀, so is λ₅ in b₁ as in FIG. 11(b). Further assume that band b₀ is affected by a band failure. Instead of having to re-route the traffic carried by band b₀ using a backup BS along a link-disjoint path, one may use a technique which we call band merging, whereby the traffic carried by wavelengths λ₀ and λ₁ can be restored on their corresponding wavelengths in b₁ (i.e., λ₃ and λ₄, respectively). Note that, the traffic carried on λ₅ should remain intact as a result of band merging as its corresponding wavelength λ₂ in b₀ is inactive. Also, while the band merging, technique can be implemented by simply converting λ₀ and λ₁ to λ₃ and λ₄, respectively, it may also be implemented by using a novel device operating under a principle similar to that of waveband conversion, which can avoid demultiplexing bands b₀ and b₁, as required by wavelength conversion. We research the feasibility and design of such a novel band-merging device that merges two bands into one that may or may not use the same band as one of the input bands.

[0182] Cost Models for Nodes and Networks

[0183] So far, existing work on WBS networks has focused on minimizing the port count only. Even in our preliminary research, we only considered the trade-off between the number of fibers/wavelengths and the number of MG-OXC ports. We build comprehensive and practical cost models and use them for the design and evaluation of WBS networks (as well as comparison between WBS networks and WRNs).

[0184] To begin with, we develop the following notations with respect to node architectures:

[0185] C_(TX), C_(RX), C_(DXC): The cost of transmitters/receivers, and the DXC used for local add/drop ports;

[0186] C_(WXC), C_(BXC), C_(FXC): The cost of an optical wavelength/band/fiber cross-connect, which is a function of their sizes (or port counts);

[0187] C_(FTB), C_(BTF): The cost of a fiber-to-band demultiplexer, or band-to-fiber multiplexer, which is a function of number of bands per fiber;

[0188] C_(FTW), C_(WTF): The cost of a fiber-to-wavelength demultiplexer, or wavelength-to-fiber multiplexer, which is a function of number of wavelengths per fiber;

[0189] C_(BTW), C_(WTB): The cost of a band-wavelength demultiplexer, or wavelength-to-band multiplexer, which is a function of number of wavelengths per band;

[0190] C_(Wconv), C_(Bconv): The cost of wavelength and waveband conversion banks;

[0191] Based on the above, we can develop a cost model for each MG-OXC architecture. For example, the cost of one single-layer MG-OXC shown in FIG. 2 may be calculated with the following formula:

C _(MG-OXC) =C _(FXC) +C _(BXC) +C _(WXC) +C _(FTB) +C _(BTW) +C _(WTB) +C _(BTF) +C _(TX) +C _(RX) +C _(DXC) +C _(Wconv) +C _(Bconv)  (23)

[0192] Clearly, the cost model of a multi-layer MG-OXC may be more (e.g., include additional FTB demultiplexers for interconnecting FXC and BXC layers). On the other hand, while the cost model of an ordinary-OXC will not include terms like C_(FXC) and C_(BXC), its actual cost may be more because of the much larger value (cost) of the term C_(WXC).

[0193] With respect to a network, we should consider not only the cost of all nodes, but also the cost of wavelengths/fibers (including amplifiers), to be denoted by C_(fiber). In order to simplify the cost model, we may lump the costs of FTB, FTW, or BTW into C_(Demux), the cost of BTF, WTF, or WTB into C_(mux), and the cost of FXC, BXC, and WXC into C_(PXC), and use the following cost model for a WBS network.

C _((Network)) =C _(Demux) +C _(Mux) +C _(PXC) +C _(TX) +C _(RX) +C _(DXC) +C _(Wconv) +C _(Bconv) +C _(fiber)  (24)

[0194] Note that the above models include all key components and thus are comprehensive.

[0195] Performance Evaluation with Static Traffic Pattern TABLE 1 Results for a six-node network (F = 2, B = 2, W = 2) Optimal WBS WBO-RWA BPHT 1 Σt_(p) 25 31 53 25 31 53 25 31 53 2 OXC — — — 71 83 142 — — — 3 T(a) 0.48 0.42 0.51 1.23 0.84 1.26 0.54 0.43 0.56 4 M(a) 0.69 0.50 0.73 1.44 1.19 1.50 0.63 0.50 0.69 5 W(a) 1.02 1.02 1.01 1.00 1.00 1.00 1.00 1.02 1.02

[0196] Table 1 shows the total number of ports needed in a randomly generated six-node network, where the number of fiber pairs per link is F=2, the number of bands is B=2, and the number of wavelengths per band is W=2. We examined three random traffic patterns, wherein the total number of lightpaths established, denoted by Σt_(p) as Row 1, is 25, 31, and 53, respectively. As can be seen from Row 2 (“OXC”) without using WBS, the total port count of ordinary OXCs in 71, 83, and 142, respectively.

[0197] Row 3 (“T(a)”) shows the ratio of the total port count of MG-OXCs to that of the ordinary OXCs (where “a” stands for algorithm, which could either be optimal WBS, WBO-RWA or BPHT). As can be seen, T(a)<1 for both optimal WBS and BPHT under all three traffic patterns but not WBO-RWA in two cases, implying that using the former two algorithms reduces the port count, but using the third one may backfire.

[0198] Row 4 (“M(a)”) shows the ratio of the port count of the largest MG-OXC to that of the largest OXC. Interestingly, M(WBO-RWA)>1, meaning that using WBO-RWA may create a “bottleneck” node. From these results, it is clear that BPHT can perform much better than WBO-RWA and in fact can achieve near-optimal results.

[0199] Row 5 (“W(a)”) shows the ratio of the wavelength hops used by using a WBS algorithm to that used by an optimal RWA algorithm (i.e., without WBS). Obviously, W(WBO-RWA) has to be one definition. Interestingly, both optimal WBS and BPHT may result in a larger than 1 ratio W(a), meaning that they may use more wavelength-hops (WHs) than optimal RWA. In other words, there is a trade-off between the number of WHs used and the number of ports needed. This is reasonable because the objective of both optimal WBS and BPHT is not to minimize WHs. In fact, since their objective is to group as many lightpaths in a band as possible, they may choose a longer route to establish a lightpath, which results in a larger WHs.

[0200]FIG. 12 compares the improvement ratio T(a) obtained from our detailed analysis of BPHT with those from simulation of BPHT for the NSF network, where F=1, B=60, W=4, as a function of the uniform traffic intensity (i.e., the number of lightpaths per node pair). As can be seen, the analytic results are accurate, and match our simulation results, especially at the points where the traffic demand is a multiple of the waveband granularity W. Note the reason that T(BPHT) drops when the traffic intensity per node pair is a multiple of W=4 is that one can effectively assign wavelengths in the same band to lightpaths from the same source to the same destination in such case. From the upper bound analysis, we can also see that an inappropriate WBS algorithm may result in as much as 40% increase (instead of decrease) in the port count due to the overhead associated with MG-OXCs (in terms of multiplexer/demultiplexer ports for connecting different layers).

[0201]FIG. 13 studies the impact of random (non-uniform) traffic. It also illustrates how the port count reduction ratio T(a) varies with W when the total number of wavelengths per link (which is F·K) is fixed at 240, i.e., F*B*W=240). For a fixed F (from 1 to 4), there seems to be an optimal value of W, which minimizes T(BPHT). The results also confirmed that T(WBO-RWA)>1, meaning that in this case, simply extending RWA to WBS networks may indeed backfire. Also from the figure, when the total number of wavelengths per link is fixed, a larger F results in a smaller T(BPHT) (thus a more significant reduction in the port count) but a larger T(WBO-RWA), implying that, on one hand, it is critical to use an intelligent WBS algorithm in a multi-fiber network, and on the other hand, WBS can be even more beneficial in multi-fiber networks.

[0202] Performance Evaluation with Incremental Traffic Pattern

[0203]FIG. 14 shows how the blocking probability changes with μ. We compared the results (blocking) of heuristic MIWRA for different weight parameters, we find that using “Min H/L First” reduced the blocking probability the maximum, when compared to “Max L First” and Random and First Fit (i.e., min H) heuristics. As described previously, increasing μ means increasing the number of ports at the MG-OXCs. However, our results of heuristic MIWRA shows when μ is big enough (e.g., 0.5), increasing μ further does not help at all in reducing the blocking probability. Specifically, for heuristic “Min H/L first”, μ=0.5 is enough. After that, an even larger value of μ (i.e., ports) does not help reduce the blocking probability.

[0204] As mentioned previously, to achieve bandwidth efficiency and at the same time, minimize the port count in WBS networks is very challenging. All existing approaches settle for some kind of trade-offs if not totally neglect to achieve bandwidth efficiency. Further, the design of a MG-OXC architecture, algorithms for utilizing wavelength/waveband conversion, and algorithms for protection/restoration in WBS networks are not intuitive and have not been considered.

[0205] Thus, it is seen that the objects of the invention are efficiently obtained, although modifications and changes to the invention should be readily apparent to those having ordinary skill in the art, and these changes and modifications are intended to be within the scope of the claims. 

What is claimed is:
 1. A method of managing data traffic in an optical network, comprising the steps of: routing at least one wavelength through a WBS network; and, converting said at least one wavelength by MG-OXC.
 2. The method of claim 1 further comprising the step of protecting and restoring said at least one wavelength.
 3. The method of claim 1 wherein said traffic is off-line.
 4. The method of claim 1 wherein said traffic is on-line.
 5. A method of managing data traffic in an optical network, comprising the steps of: routing at least one waveband through a WBS network; and, converting said at least one waveband by MG-OXC.
 6. The method of claim 5 further comprising the step of protecting and restoring said at least one wavelength.
 7. The method of claim 5 wherein said traffic is off-line.
 8. The method of claim 5 wherein said traffic is on-line.
 9. An apparatus for managing data traffic in an optical network, comprising: means for routing at least one wavelength through a WBS network; and, means for converting said at least one wavelength by MG-OXC.
 10. An apparatus for managing data traffic in an optical network, comprising: means for routing at least one waveband through a WBS network; and, means for converting said at least one waveband by MG-OXC.
 11. A method for managing static data traffic of at least one light path in an optical network, comprising the steps of: achieving load balanced path routing for said at least one light path; assigning wavelengths to demands of said at least one light path; and, switching said at least one light path according to its assigned wavelength.
 12. The method of claim 11 wherein said step of achieving load balance routing comprises the steps of: finding a K-shortest route for every node pair (s,d) with non-zero traffic demand; ordering said node pair routes (P_(s,d)) from the shortest to the longest, in terms of hop number (H), wherein P_(s,d) ¹, P_(s,d) ², . . . , P_(s,d) ^(k) and letting the number of hops of the shortest route be H_(s,d) (i.e., number of hops in path P_(s,d) ¹); defining the load on every link l to be the number of routes already using link l with C being the maximum link load over all the links; and, using C to accomplish said step of achieving load balance by starting with the node pair (s,d) with the largest H_(s,d) value over all node pairs, to determine the route for each node pair.
 13. The method of claim 11, wherein said step of assigning wavelengths, comprises the steps of: defining a set Q_(d) ^(s) which includes all node pairs (s_(i), s_(j)), whose route is s_(i), s_(i+1), . . . , s_(j) as determined in said step of achieving load balanced path routing, where 0≦i≦n−2, and i+2≦j≦n, for every node pair (s,d), whose route is determined as s=s_(o)→s₁→s₂ . . . s_(n−1)→s_(n)=d in said step of achieving load balanced path routing; calculating the weight for each set Q_(d) ^(s) as ${W_{sd} = \sum\limits_{p \in Q_{d}^{s}}^{\quad}}\quad$

hp×t_(p), where p=(s_(i),s_(j)) ε Q_(d) ^(s), h_(p) is the number of hops and t_(p) is the required number of light paths from s_(i) to s_(j); finding the set Q_(d) ^(s) with the largest W_(sd)*; calling set Q_(d) ^(s) as L, and assigning wavelengths to L; and, recomputing the weight for those node pairs whose routes use any part of the route used by node pair (s,d) by, for each fiber, re-adjusting b and w to be the “next” waveband and the first wavelength in the next waveband, respectively, so as to prevent the light paths of the next node pair set (e.g., Q_(d′) ^(s′)) from using the same bands as the light paths of Q_(d) ^(s).
 14. The method of claim 13 wherein said step of assigning wavelengths to L, comprises the steps of: assigning a longest path in L is as follows: s_(o)→s₁→s₂ . . . s_(n−1)→s_(n) wherein s=s_(o) and d=s_(n); assigning wavelengths to the requested light paths for the node pair (s,d) by grouping them into the same fiber, and within each fiber, into the same band, wherein for each fiber, 0≦w≦K−1 and 0≦b≦B−1 is the index of wavelength and band respectively, starting from which, an available wavelength and band are searched in order to fulfill new light path requests, and 0≦f≦F−1 is the index of the fiber currently under consideration; using a WA-MF-WBS algorithm to assign wavelengths to the requested light paths for (s,s_(j)), starting with the largest j (i.e., j=n−1, n−2, . . . ,2); using said WA-MF-WBS algorithm to assign wavelengths to the requested light paths for (s_(i),d) starting with the smallest i (i.e., i=1, 2 . . . , n−2); and, repeating said WA-MF-WBS assignments by treating s_(i) with the smallest i as s, and s_(j) with the largest j as d until all said node pairs (s_(i), s_(j)) ε Q_(d) ^(s) have been considered.
 15. The method of claim 14, wherein the WA-MF-WBS algorithm is: while t_(p) > W do $\begin{matrix} {{Find}\quad a\quad {fiber}\quad {starting}\quad {from}\quad {index}\quad f\quad {that}\quad {has}\quad {as}\quad {many}\quad {free}\quad {bands}\quad {as}} \\ {{possible}\quad \left( {{{say}\quad a} \leq \left\lfloor \frac{tp}{W} \right\rfloor} \right)\{} \end{matrix}\quad\quad$

Call the found fiber g, where g may or may not be the same as f; Assign the bands in fiber g to the a. W light paths for p; t_(p) = t_(p) − a · W; Set f = g, and update w and b for fiber g accordingly; } end while while t_(p) > 0 do Find a fiber (g), starting from index f, that has at least one free wavelength; Assign a free wavelength (x), starting from index w, to a light path for p, where x is most likely to be w; t_(p) = t_(p) − 1; Set f = g, and w = x +
 1. Also, update b for fiber g accordingly; end while


16. A method for managing dynamic data traffic of at least one light path in an optical network, comprising the steps of: routing the K-shortest path, which has the largest interference length (L); and, assigning waveband with a First-Fit network topology based on band/port number restriction and minimum weight.
 17. The method of claim 16, wherein said First-Fit network topology includes at least one fiber, wherein each fiber has two bands b₀ and b₁, and each band has two wavelengths, at least two light paths: λ₀(S₂→S₃ ) and λ₂(S₄→S₅→S₆→S₇) and a new light path demand from S₀ to S₇ so there are at least two paths to route the demand: k₀(S₀→S₁→S₂→S₃→S₇) and k_(i) (S₀→S₄→S₅→S₆→S₇); further comprising the steps of: attempting to satisfy a new light path demand by, within every layer by a method comprising the steps of: calculating the weight for every (k,b) pair, W_(k) ^(b), where 0≦k<K is the index of shortest path, 0≦b<B is index of band, finding the minimum W_(k) ^(b), which can satisfy the demand, assigning the corresponding wavelength to the new demand in layer b, using the kth shortest path; and, blocking said light path demand if no layer can satisfy it.
 18. The method of claim 17, wherein the method to set the weight is selected from the group consisting of W_(k) ^(b)=h, where h is the hop number, $W_{k}^{b} = \frac{1}{L,}$

where L is interference length L (number of shared links), and $W_{k}^{b} = {\frac{h}{L}.}$ 